CTL Model Update: Semantics, Computations and Implementation

نویسندگان

  • Yulin Ding
  • Yan Zhang
چکیده

Minimal change is a fundamental principle for modeling system dynamics. In this paper, we study the issue of minimal change for Computational Tree Logic (CTL) model update. We first propose five primitive operations which capture the basic update of the CTL model, and then define the minimal change criteria for CTL model update based on these primitive operations. We provide essential semantic and computational characterizations for our CTL model update approach. We develop a formal algorithm to implement this update that employs the underlying minimal change principle. We also present a CTL model update example using the well known microwave oven scenario.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of CTL Model Checker Update

In this paper is presented an update of the model checker CTL. The minimal modifications which appear represent the fundamental concept for model the dynamic system. In the paper used five primitive operations discompose from the operation of a CTL update used already by [1] which are presented their approach of knowledge update the structures of single agent S5 Kripke. Then is willed defined t...

متن کامل

A Case Study for CTL Model Update

Computational Tree Logic (CTL) model update is a new system modification method for software verification. In this paper, a case study is described to show how a prototype model updater is implemented based on the authors’ previous work of model update theoretical results [4]. The prototype is coded in Linux C and contains model checking, model update and parsing functions. The prototype is app...

متن کامل

A duality between LM-fuzzy possibility computations and their logical semantics

Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...

متن کامل

Clocked Temporal Logic Programming

Clocked temporal logic programming(CTLP) is an extension of logic programming based on a clocked temporal logic(CTL). In CTL, predicates are associated with local clocks. Local clocks can be used to model multiple granularity of time, thus the resulting temporal logic programming language, called Chronolog(MC), has a stronger modeling power. This paper discusses the logical basis of the languag...

متن کامل

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation

Abstract interpretation provides a practical approach to verifying properties of infinite-state systems. We apply the framework of abstract interpretation to derive an abstract semantic function for the modal μ-calculus, which is the basis for abstract model checking. The abstract semantic function is constructed directly from the standard concrete semantics together with a Galois connection be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006